Non-monotone Dualization via Monotone Dualization

نویسندگان

  • Yoshitaka Yamamoto
  • Koji Iwanuma
  • Katsumi Inoue
چکیده

The non-monotone dualization (NMD) is one of the most essential tasks required for finding hypotheses in various ILP settings, like learning from entailment [1, 2] and learning from interpretations [3]. Its task is to generate an irredundant prime CNF formula ψ of the dual f where f is a general Boolean function represented by CNF [4]. The DNF formula φ of f is easily obtained by De Morgan’s laws interchanging the connectives of the CNF formula. Hence, the main task of NMD is to translate the DNF φ to an equivalent CNF ψ. This translation is used to find an alternative representation of the input form. For instance, given a set of models, it is desirable to seek underlying structure behind the models.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Berge Multiplication for Monotone Boolean Dualization

Given the prime CNF representation φ of a monotone Boolean function f : {0, 1} 7→ {0, 1}, the dualization problem calls for finding the corresponding prime DNF representation ψ of f . A very simple method (called Berge multiplication [3, Page 52–53]) works by multiplying out the clauses of φ from left to right in some order, simplifying whenever possible using the absorption law. We show that f...

متن کامل

On Berge Multiplication for Monotone Boolean Dualization

Given the prime CNF representation φ of a monotone Boolean function f : {0, 1} 7→ {0, 1}, the dualization problem calls for finding the corresponding prime DNF representation ψ of f . A very simple method (called Berge multiplication [3, Page 52–53]) works by multiplying out the clauses of φ from left to right in some order, simplifying whenever possible using the absorption law. We show that f...

متن کامل

Dualization in lattices given by ordered sets of irreducibles

Dualization of a monotone Boolean function on a finite lattice can be represented by transforming the set of its minimal 1 to the set of its maximal 0 values. In this paper we consider finite lattices given by ordered sets of their meet and join irreducibles (i.e., as a concept lattice of a formal context). We show that in this case dualization is equivalent to the enumeration of so-called mini...

متن کامل

Eecient Read-restricted Monotone Cnf/dnf Dualization by Learning with Membership Queries Produced as Part of the Esprit Working Group in Neural and Computational Learning Ii, Neurocolt2 27150

We consider exact learning monotone CNF formulas in which each variable appears at most some constant k times (\read-k" monotone CNF). Let f : f0;1g n ! f0;1g be expressible as a read-k monotone CNF formula for some natural number k. We give an incremental output polynomial time algorithm for exact learning both the read-k CNF and (not necessarily read restricted) DNF descriptions of f. The alg...

متن کامل

On the Complexity of Dualization of Monotone Disjunctive Normal Forms

We show that the duality of a pair of monotone disjunctive normal forms of size n can be tested in n oŽlog n.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012